Derivation of an eigenvalue probability density function relating to the Poincaré disk

نویسنده

  • Peter J. Forrester
چکیده

A result of Zyczkowski and Sommers [J. Phys. A 33, 2045–2057 (2000)] gives the eigenvalue probability density function for the top N ×N sub-block of a Haar distributed matrix from U(N + n). In the case n ≥ N , we rederive this result, starting from knowledge of the distribution of the sub-blocks, introducing the Schur decomposition, and integrating over all variables except the eigenvalues. The integration is done by identifying a recursive structure which reduces the dimension. This approach is inspired by an analogous approach which has been recently applied to determine the eigenvalue probability density function for random matrices AB, where A and B are random matrices with entries standard complex normals. We relate the eigenvalue distribution of the sub-blocks to a many body quantum state, and to the one-component plasma, on the pseudosphere.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new probability density function in earthquake occurrences

Although knowing the time of the occurrence of the earthquakes is vital and helpful, unfortunately it is still unpredictable. By the way there is an urgent need to find a method to foresee this catastrophic event. There are a lot of methods for forecasting the time of earthquake occurrence. Another method for predicting that is to know probability density function of time interval between earth...

متن کامل

A random matrix decimation procedure relating β = 2 / ( r + 1 ) to β = 2 ( r + 1 )

Classical random matrix ensembles with orthogonal symmetry have the property that the joint distribution of every second eigenvalue is equal to that of a classical random matrix ensemble with symplectic symmetry. These results are shown to be the case r = 1 of a family of interrelations between eigenvalue probability density functions for generalizations of the classical random matrix ensembles...

متن کامل

فشرده سازی اطلاعات متغیر با زمان با استفاده از کد هافمن

Abstract: In this paper, we fit a function on probability density curve representing an information stream using artificial neural network . This methodology result is a specific function which represent a memorize able probability density curve . we then use the resulting function for information compression by Huffman algorithm . the difference between the proposed me then with the general me...

متن کامل

Application of tests of goodness of fit in determining the probability density function for spacing of steel sets in tunnel support system

One of the conventional methods for temporary support of tunnels is to use steel sets with shotcrete. The nature of a temporary support system demands a quick installation of its structures. As a result, the spacing between steel sets is not a fixed amount and it can be considered as a random variable. Hence, in the reliability analysis of these types of structures, the selection of an appropri...

متن کامل

‘‘Single ring theorem’’ and the disk-annulus phase transition

Recently, an analytic method was developed to study in the large N limit nonHermitian random matrices that are drawn from a large class of circularly symmetric non-Gaussian probability distributions, thus extending the existing Gaussian non-Hermitian literature. One obtains an explicit algebraic equation for the integrated density of eigenvalues from which the Green’s function and averaged dens...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009